A Final Coalgebra for k-regular Sequences

نویسندگان

  • Helle Hvid Hansen
  • Clemens Kupke
  • Jan J. M. M. Rutten
  • Joost Winter
چکیده

We study k-regular sequences from a coalgebraic perspective. Building on the observation that the set of streams over a semiring S can be turned into a final coalgebra, we obtain characterizations of kregular sequences in terms of finite weighted automata, finite systems of behavioral differential equations, and recognizable power series. The latter characterization is obtained via an isomorphism of final coalgebras based on the k-adic numeration system.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Power-Set Functors and Saturated Trees

We combine ideas coming from several fields, including modal logic, coalgebra, and set theory. Modally saturated trees were introduced by K. Fine in 1975. We give a new purely combinatorial formulation of modally saturated trees, and we prove that they form the limit of the final ωopchain of the finite power-set functor Pf . From that, we derive an alternative proof of J. Worrell’s description ...

متن کامل

Proper Functors and their Rational Fixed Point

The rational fixed point of a set functor is well-known to capture the behaviour of finite coalgebras. In this paper we consider functors on algebraic categories. For them the rational fixed point may no longer be a subcoalgebra of the final coalgebra. Inspired by Ésik and Maletti’s notion of proper semiring, we introduce the notion of a proper functor. We show that for proper functors the rati...

متن کامل

On Final Coalgebras of Power-Set Functors and Saturated Trees - To George Janelidze on the Occasion of His Sixtieth Birthday

The final coalgebra for the finite power-set functor was described by Worrell who also proved that the final chain converges in ω + ω steps. We describe the step ω as the set of saturated trees, a concept equivalent to the modally saturated trees introduced by K. Fine in the 1970s in his study of modal logic. And for the bounded power-set functors Pλ, where λ is an infinite regular cardinal, we...

متن کامل

Towards a Coalgebraic Chomsky Hierarchy

The Chomsky hierarchy plays a prominent role in the foundations of theoretical computer science relating classes of formal languages of primary importance as well as the grammars and machine models that represent those language classes. It is well-known that regular languages can be captured by coalgebras. They form precisely the image of all finite coalgebras for the set functor X 7→ 2×X under...

متن کامل

MINIMIZATION OF DETERMINISTIC FINITE AUTOMATA WITH VAGUE (FINAL) STATES AND INTUITIONISTIC FUZZY (FINAL) STATES

In this paper, relations among the membership values of gener- alized fuzzy languages such as intuitionistic fuzzy language, interval-valued fuzzy language and vague language are studied. It will aid in studying the properties of one language when the properties of another are known. Further, existence of a minimized nite automaton with vague ( final) states for any vague regular language recog...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014